On solving cycle problems with Branch-and-Cut: extending shrinking and exact subcycle elimination separation algorithms

نویسندگان

چکیده

In this paper, we extend techniques developed in the context of Travelling Salesperson Problem for cycle problems. Particularly, study shrinking support graphs and exact algorithms subcycle elimination separation The efficient application considered has proved to be essential when solving large size problems by Branch-and-Cut, been motivation behind work. Regarding graphs, prove validity Padberg–Rinaldi general rules Crowder–Padberg subcycle-safe rules. Concerning problems, two algorithms, Dynamic Hong Extended Padberg–Grötschel which are shown superior ones used so far literature proposed empirically tested 24 problem instances generated Orienteering (involving up 15,112 vertices) with Branch-and-Cut. experiments suggest relevance obtained average speedup together is around 50 times medium-sized 250 large-sized instances.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Solving resource constrained shortest path problems with Branch-and-Cut

In the resource constrained shortest path problem (RCSPP) a shortest path satisfying additional resource bounds is sought. Each arc has a length and a resource usage vector specifying the requirements from each resource of a finite set of resources. The resource bounds limit the total usage along feasible paths for each resource type. In this paper we introduce new cutting planes, separation pr...

متن کامل

Solving Routing Problems with Branch-Cut-and-Price

Marcus Poggi de Aragão Dep.de Informática Pontif́ıcia Universidade Católica do Rio de Janeiro [email protected] Eduardo Uchoa Dep. Eng. de Produção Universidade Federal Fluminense [email protected] January 15th, 2005 The Capacitated Vehicle Routing Problem (CVRP) is the most basic variant of a vehicle routing problem: homogeneous fleet, single depot, only deliveries, no time-windows, and ...

متن کامل

Branch and Cut Algorithms

is the objective function to be optimized over P . Whenever all variables in (1.1) are restricted to be integral, the problem is known as a linear integer programming (IP) problem. Conversely, a pure linear programming (LP) problem results when all variables in (1.1) are restricted to be real valued. As is frequently the case for MIP, instead of attempting to optimize (1.3) directly over P , it...

متن کامل

Branch-cut-price algorithms for solving a class of search problems on general graphs

We consider graph search problems involving an intruder and mobile searchers. The graph consists of nodes on which the intruder and searchers may be located, and edges on which these entities travel. Associated with each node is a set of nodes that are visible from that node. The goal is to find the minimum number of searchers needed to detect the intruder within a given time limit. We investig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Annals of Operations Research

سال: 2021

ISSN: ['1572-9338', '0254-5330']

DOI: https://doi.org/10.1007/s10479-021-04210-0